package leetcode;

/**
 * 描述:746. 使用最小花费爬楼梯
 *
 * @author Madison You
 * @created 23:43
 */
public class Easy_746_MinCostClimbingStairs {
    public static void main(String[] args) {
        int[] ints = {10,15,20};
        new Easy_746_MinCostClimbingStairs().minCostClimbingStairs(ints);
    }
    public int minCostClimbingStairs(int[] cost) {
        int[] dp = new int[cost.length];
        dp[0] = cost[0];
        dp[1] = cost[1];
        for(int i = 2 ; i < cost.length; i ++) {
            dp[i] = Math.min(dp[i-1],dp[i-2]) + cost[i];
        }
        return Math.min(dp[cost.length - 1],dp[cost.length - 2]);
    }
}
